Shortest paths with ordinal weights
نویسندگان
چکیده
منابع مشابه
Clauset 1 Shortest Paths with Weights
Recall that BFS is a special case the general Search-Tree(G,s) algorithm in which we store the vertices that border our growing tree T in a first-in-first-out (FIFO) queue. In this way, the algorithm explores every vertex of distance ` from the source vertex s before we explore any vertex of distance ` + 1, for all `. Its output is a tree T that contains the union of “geodesic” or shortest path...
متن کاملShortest Paths with Bundles and Non-additive Weights Is Hard
In a standard path auction, all of the edges in a graph are sold as separate entities, each edge having a single cost. We consider a generalisation in which a graph is partitioned and each subset of edges has a unique owner. We show that if the owner is allowed to apply a non-additive pricing structure then the winner determination problem becomes NP-hard (in contrast with the quadratic time al...
متن کاملAll Pairs Shortest Paths in Undirected Graphs with Integer Weights
We show that the All Pairs Shortest Paths (APSP) problem for undirected graphs with integer edge weights taken from the range f1; 2; : : : ;Mg can be solved using only a logarithmic number of distance products of matrices with elements in the range f1; 2; : : : ;Mg. As a result, we get an algorithm for the APSP problem in such graphs that runs in ~ O(Mn!) time, where n is the number of vertices...
متن کاملFully Dynamic All Pairs Shortest Paths with Real Edge Weights
We present the first fully dynamic algorithm for maintaining all pairs shortest paths in directed graphs with real-valued edge weights. Given a dynamic directed graph G such that each edge can assume at most S different real values, we show how to support updates in O(n2.5 √ S log n ) amortized time and queries in optimal worst-case time. No previous fully dynamic algorithm was known for this p...
متن کاملI/O-Efficient Undirected Shortest Paths with Unbounded Weights
We present an algorithm for computing single-source shortest paths in undirected graphs with non-negative edge weights in O( √ nm/B logn+MST(n,m)) I/Os, where n is the number of vertices, m is the number of edges, B is the disk block size, and MST(n,m) is the I/O-cost of computing a minimum spanning tree. Our algorithm is based on our previous algorithm for graphs with bounded edge weights. Our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2020
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2019.08.008